Testing and Validation of Peer-to-peer Systems. (Test et Validation des Systémes Pair-à-pair)
نویسنده
چکیده
Peer-to-peer (P2P) offers good solutions for many applications such as large data sharing and collaboration in social networks. Thus, it appears as a powerful paradigm to develop scalable distributed applications, as reflected by the increasing number of emerging projects based on this technology. However, building trustworthy P2P applications is difficult because they must be deployed on a large number of autonomous nodes, which may refuse to answer to some requests and even leave the system unexpectedly. This volatility of nodes is a common behavior in P2P systems and can be interpreted as a fault during tests. In this thesis, we propose a framework and a methodology for testing and validating P2P applications. The framework is based on the individual control of nodes, allowing test cases to precisely control the volatility of nodes during their execution. We also propose three different architectures to control the execution of test cases in distributed systems. The first approach extends the classical centralized test coordinator in order to handle the volatility of peers. The other two approaches avoids the central coordinator in order to scale up the test cases. We validated the framework and the methodology through implementation and experimentation on two popular open-source P2P applications (i.e. FreePastry and OpenChord). The experimentation tests the behavior of the system on different conditions of volatility and shows how the tests were able to detect complex implementation problems.
منابع مشابه
Définition et diffusion de signatures sémantiques dans les systèmes pair-à-pair
Résumé. Les systèmes pair-à-pair (peer-to-peer, P2P, égal-à-égal) se sont popularisés ces dernières années avec les systèmes de partage de fichiers sur Internet. De nombreuses recherches concernant l’optimisation de la localisation des données ont émergé et constituent un axe de recherche très actif. La prise en compte de la sémantique du contenu des pairs dans le routage des requêtes permet d’...
متن کاملRoutage Efficace pour les Réseaux Pair-à-Pair utilisant des Tables de Hachage Distribuées. (Efficient routing in dht-based peer-to-peer networks)
.......................................................................................................... 9 RÉSUMÉ .............................................................................................................. 11 TABLE DES MATIÈRES .................................................................................. 13 INTRODUCTION ....................................................
متن کاملSystèmes pair-à-pair sémantiques et extension non conservative d’une base de connaissances Peer-to-Peer Semantic Systems and Non Conservative Extension of a Knowledge Base
Cet article montre en quoi la notion d’extension non conservative d’une base de connaissances (KB) est importante dans les sytèmes d’inférence pair-àpair (P2PIS), aussi connus sous le nom de systèmes pair-à-pair sémantiques. Cette notion est utile à un pair afin de détecter si (une partie de) sa KB est corrompue par un P2PIS ou pour apprendre du P2PIS de nouvelles connaissances sur son propre d...
متن کاملBALLS: A structured peer-to-peer system with integrated load balancing
Load balancing is an important problem for structured peer-to-peer systems. We are particularly interested in the consumption of network bandwidth for routing traffic and in the usage of computer resources for object storage. In this paper, we investigate the possibility to simultaneously balance these two types of load. We present a structured peer-to-peer overlay that efficiently performs suc...
متن کاملPrésentée Et Soutenue Publiquement Par Optimisation De Requêtes Xquery Dans Des Bases De Données Xml Distribuées Sur Des Réseaux Pair-à-pair Optimizations of Xquery in Peer-to-peer Distributed Xml Databases
rateurs optimisés et une technique d'évaluation parallèle des sous-expressions permettent l'exécution efficace d'opérations avec des volumes de données im-portants.
متن کامل